On Axiomatization of Probabilistic Conditional Independencies
نویسندگان
چکیده
This paper studies the connection between probabilistic conditional independence in un certain reasoning and data dependency in re lational databases. As a demonstration of the usefulness of this preliminary investigation, an alternate proof is presented for refuting the conjecture suggested by Pearl and Paz that probabilistic conditional independencies have a complete axiomatization.
منابع مشابه
Probabilistic Conditional Independence under Schema Certainty and Uncertainty
Conditional independence provides an essential framework to deal with knowledge and uncertainty in Artificial Intelligence, and is fundamental in probability and multivariate statistics. Its associated implication problem is paramount for building Bayesian networks. Saturated conditional independencies form an important subclass of conditional independencies. Under schema certainty, the implica...
متن کاملPropositional Reasoning about Saturated Conditional Probabilistic Independence
Conditional independence provides an essential framework to deal with knowledge and uncertainty in Artificial Intelligence, and is fundamental in probability and multivariate statistics. Its associated implication problem is paramount for building Bayesian networks. Unfortunately, the problem does not enjoy a finite ground axiomatization and is already coNP-complete to decide for restricted sub...
متن کاملOn Axiomatizing Probabilistic Conditional Independencies in Bayesian Networks
Several researchers have suggested that Bayesian networks (BNs) should be used to manage the inherent uncertainty in information retrieval. However, it has been argued that manually constructing a large BN is a difficult process. In this paper, we obtain the only minimal complete subset of the semi-graphoid axiomatization governing the independency information in a BN. This result may be useful...
متن کاملTesting Implication of Probabilistic Dependencies
Axiomatization has been widely used for test ing logical implications. This paper suggests a non-axiomatic method, the chase, to test if a new dependency follows from a given set of probabilistic dependencies. Although the chase computation may require exponential time in some cases, this technique is a pow erful tool for establishing nontrivial theoreti cal results. More importantly, this a...
متن کاملEquivalent Characterization of a Class of Conditional Probabilistic Independencies
Markov networks utilize nonembedded probabilistic conditional independencies in order to provide an economical representation of a joint distribution in uncertainty management. In this paper we study several properties of nonembedded conditional independencies and show that they are in fact equivalent. The results presented here not only show the useful characteristics of an important subclass ...
متن کامل